Enumeration of M-ary Cacti

نویسندگان

  • Michel Bousquet
  • Gilbert Labelle
  • Pierre Leroux
چکیده

The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classiication of complex polynomials having at most m critical values, studied by Zvonkin and others. We obtain explicit formulae for both labelled and unlabelled m-ary cacti, according to i) the number of polygons, ii) the vertex-color distribution, iii) the vertex-degree distribution of each color. We also enumerate m-ary cacti according to the order of their automorphism group. Using a generalization of Otter's formula, we express the species of m-ary cacti in terms of rooted and of pointed cacti. A variant of the m-dimensional La-grange inversion is then used to enumerate these structures. The method of Liskovets for the enumeration of unrooted planar maps can also be adapted to m-ary cacti.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of m-ary cacti according to their color and degree distributions

We enumerate cyclically colored m-gonal plane cacti (called m-ary cacti) according to the degree distribution of vertices of each color. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m critical values, studied by Zvonkin and others. The corresponding problem for rooted m-ary cacti has been solved by Goulden and Jackson in connect...

متن کامل

Partitioned Cacti: a Bijective Approach to the Cycle Factorization Problem

In this paper we construct a bijection for partitioned 3-cacti that gives raise to a new formula for enumeration of factorizations of the long cycle into three permutations with given number of cycles. Résumé. Dans cet article, nous construisons une bijection pour 3-cacti partitionnés faisant apparaı̂tre une nouvelle formule pour l’énumération des factorisations d’un long cycle en trois permutat...

متن کامل

Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition

Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes. By building on the work of Gioan and Paul (2012) and Chauve et al. (2014), we show a methodology by which we constrain a split-decomposition tree to avoid certain patterns, thereby avoiding the corresponding ...

متن کامل

m-Ary Hypervector Space: Convergent Sequences and Bundle Subsets.

In this paper, we have generalized the definition of vector space by considering the group as a canonical $m$-ary hypergroup, the field as a krasner $(m,n)$-hyperfield and considering the multiplication structure of a vector by a scalar as hyperstructure. Also we will be consider a normed $m$-ary hypervector space and introduce the concept of convergence of sequence on $m$-ary hypernormed space...

متن کامل

On exact category of $(m, n)$-ary hypermodules

We introduce and study category of $(m, n)$-ary hypermodules as a generalization of the category of $(m, n)$-modules as well as the category of classical modules. Also, we study various kinds of morphisms. Especially, we characterize monomorphisms and epimorphisms in this category. We will proceed to study the fundamental relation on $(m, n)$-hypermodules, as an important tool in the study of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007